Distributive lattices with finite projective covers
نویسندگان
چکیده
منابع مشابه
On (finite) distributive lattices with antitone involutions
Some well-known algebras of logic or other algebraic models of non-classical reasoning, such as MV-algebras or orthomodular lattices, can be regarded as lattices with antitone involutions, i.e., bounded lattices with the property that all principal filters (or ideals) are equipped with antitone involutions. This simple observation is behind the so-called “basic algebras” that were introduced in...
متن کاملFUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملFinite distributive lattices are congruence lattices of almost- geometric lattices
A semimodular lattice L of finite length will be called an almost-geometric lattice, if the order J(L) of its nonzero join-irreducible elements is a cardinal sum of at most two-element chains. We prove that each finite distributive lattice is isomorphic to the lattice of congruences of a finite almost-geometric lattice.
متن کاملRepresentation Theorem for Finite Distributive Lattices
1. INDUCTION IN A FINITE LATTICE Let L be a 1-sorted structure and let A, B be subsets of L. Let us observe that A⊆ B if and only if: (Def. 1) For every element x of L such that x ∈ A holds x ∈ B. Let L be a lattice. Observe that there exists a chain of L which is non empty. Let L be a lattice and let x, y be elements of L. Let us assume that x ≤ y. A non empty chain of L is called a x-chain of...
متن کاملComplete Valuations on Finite Distributive Lattices
We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are downset lattices of finite posets of dimension at most two, and determine a realizer through a recursive relation between weights on the poset associated to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1979
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1979.81.45